Strategies for the Implementation of Interconnection Network Simulators on Parallel Computers

نویسندگان

  • Michael Jurczyk
  • Thomas Schwederski
  • Howard Jay Siegel
  • Seth Abraham
  • Richard Martin Born
  • Janet M. Siegel
چکیده

Methods for simulating multistage interconnection networks using massively parallel SIMD computers are presented. Aspects of parallel simulation of interconnection networks are discussed and different strategies of mapping the architecture of the network to be simulated onto the parallel machine are studied and compared. To apply these methods to a wide variety of network topologies, the discussions are based on general interconnection network and switch box models. As case studies, two strategies for mapping synchronous multistage cube networks on the MasPar MP-1 SIMD machine are explored and their implementations are compared. The methods result in a simulator implementation with which 10 9 data packets can be simulated in 40 minutes on the MasPar system.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Developing Pedagogical Visualizations of Dense Matrix Operations on Interconnection-network SIMD Computers

Parallel algorithm animations provide graphical illustration of a parallel computer algorithm. Parallel algorithms can be difficult for students to understand, but it is possible with the right tools, to improve student’s understanding of such algorithms. This paper presents specific detail for creating pedagogical visualizations of parallel algorithms for dense matrix operations on interconnec...

متن کامل

Compact Lossy Inductance Simulators With Electronic Control

In this paper two R‑L network simulator configurations employing a single VDDIBA, one resistance and one grounded capacitance are presented. The first configuration is a grounded series resistor-inductor (R‑L) network simulator and the second configuration is intended for grounded parallel resister-inductor (R‑L) circuit simulation. Both the proposed circuits enjoy several beneficial features s...

متن کامل

Parallel Discrete Event Simulation of Wormhole Routing Interconnection Networks

Simulation is inevitable for dimensioning interconnection networks for parallel computers. In this study, we present the application of a parallel eventdriven simulator for k-ary 2-cube wormhole-routing interconnection networks running on the Intel Paragon and discuss simulator speedup behavior and influence of the operation modes of the simulated network (synchronous, asynchronous, and mixed m...

متن کامل

Parallel Routing Algorithms in Benes and Clos Networks: A Survey

Benes and Clos networks are an important class of multistage interconnection network due to their expandability and modularity. In this article we present a survey of parallel routing algorithms in Benes and Clos Networks. These parallel routing algorithms are compared in terms of their interconnection topologies, implementation and time complexity. Index Terms : Multistage Interconnection netw...

متن کامل

Parallel Spatial Pyramid Match Kernel Algorithm for Object Recognition using a Cluster of Computers

This paper parallelizes the spatial pyramid match kernel (SPK) implementation. SPK is one of the most usable kernel methods, along with support vector machine classifier, with high accuracy in object recognition. MATLAB parallel computing toolbox has been used to parallelize SPK. In this implementation, MATLAB Message Passing Interface (MPI) functions and features included in the toolbox help u...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998